#include <bits/stdc++.h>
using namespace std;

// #define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T>
using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x)&(-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz size()

void solve () {
    int n;
    cin >> n;
    //用数目取匹配天数，这也是很好的思维
    V<int>match (n + 1, 0), vis (n + 1, 0);
    V<V<int>>g (n + 1);

    FOR (i, 1, n) {
        int k, x;
        cin >> k;
        while (k--) {
            cin >> x;
            g[x].eb (i);
        }
    }

    function<int (int, int)>dfs = [&] (int u, int v) {
        for (auto& j : g[u]) {
            if (vis[j] != v) {
                vis[j] = v;
                if (!match[j] || dfs (match[j], v)) {
                    match[j] = u;
                    return 1;
                }
            }
        }
        return 0;
        };

    FOR (i, 1, n) {
        if (!dfs (i, i)) {
            cout << "kou is angry" << endl;
            RE;
        }
    }

    FOR (i, 1, n) {
        cout << match[i] << ' ';
    }

}

signed main () {
    int Task = 1;

    ios::sync_with_stdio (false);
    cin.tie (nullptr);
    cout.tie (nullptr);

    while (Task--) {
        solve ();
    }

    return 0;
}